Encoding de Finetti's coherence within Łukasiewicz logic and MV-algebras

نویسندگان

چکیده

The present paper investigates proof-theoretical and algebraic properties for the probability logic FP(Ł,Ł), meant reasoning on uncertainty of Łukasiewicz events. Methodologically speaking, we will consider a translation function between formulas FP(Ł,Ł) to propositional language that allows us apply latter well-developed theory MV-algebras directly probabilistic reasoning. More precisely, leveraging such map, show introduce class algebras with respect which be proved locally sound complete. Finally, these previous results investigate what called “probabilistic unification problem”. In this respect, prove Ghilardi's view can extended our case and, par case, is nullary type.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Riesz MV-algebras and their logic

We develop the general theory of RMV-algebras, which are essentially unit intervals in Riesz spaces with strong unit. Since the variety of RMV-algebras is generated by [0, 1], we get an equational characterization of the real product on [0,1] interpreted as scalar multiplication.

متن کامل

The Logic of Quasi-MV Algebras

The algebraic theory of quasi-MV algebras, generalizations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define several interesting logics from these structures, so far this aspect has not been investigated. The present article aims at filling this gap.

متن کامل

The Logic of Perfect MV-algebras

In this paper we summarize results on perfect MV-algebras and we show that the class of first order à Lukasiewicz formulas valid in all interpretations over perfect MV-chains is axiomatizable.

متن کامل

On Affine Logic and Łukasiewicz Logic

The multi-valued logic of Lukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation elimination, [DNE]. However, our understanding of Lukasiewicz logic can be improved by separating its classical and intuitionistic aspects. The intuitionistic aspect of Lukasiewicz logic ...

متن کامل

Querying with Łukasiewicz logic

In this paper we present, by way of case studies, a proof of concept, based on a prototype working on a automotive data set, aimed at showing the potential usefulness of using formulas of Łukasiewicz propositional logic to query databases in a fuzzy way. Our approach distinguishes itself for its stress on the purely linguistic, contraposed with numeric, formulations of queries. Our queries are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2023

ISSN: ['0168-0072', '1873-2461']

DOI: https://doi.org/10.1016/j.apal.2023.103337